package com.waitingresult.leetcode.easy.review;

/**
 * @Author: WangShuai
 * @CreateTime: 2023/10/26  13:12
 * @Description:
 * @Version: 1.0
 */
public class Lc01 {
    public int[] twoSum(int[] nums, int target) {
        for (int i = 0; i < nums.length; i++) {
            for (int i1 = i+1; i1 < nums.length; i1++) {
                if(target == nums[i] + nums[i1]){
                    return new int[]{i,i1};
                }
            }
        }
        return null;
    }
}
